An Integrated 256-point Complex FFT Processor for Real-time Spectrum Analysis and Measurement
نویسندگان
چکیده
This paper describes in detail the design of a custom CMOS Fast Fourier Transform(FFT) processor for computing 256-point complex FFT. The FFT is well suited for real-time spectrum analysis in instrumentation and measurement applications. The FFT butterfly processor consists of one parallel-parallel multiplier and two adders. It is capable of computing one butterfly computation every 100ns thus it can compute 256-complex point FFT in 102.4μs excluding data input and output processes.
منابع مشابه
An extensible complex fast Fourier transform processor chip for real-time spectrum analysis and measurement
This paper describes in detail the design of a CMOS custom fast Fourier transform (FFT) processor for computing a 256-point complex FFT. The FFT is well-suited for realtime spectrum analysis in instrumentation and measurement applications. The FFT butterfly processor reported here consists of one parallel–parallel multiplier and two adders. It is capable of computing one butterfly computation e...
متن کاملDesign and Simulation of FFT Processor Using Radix-4 Algorithm Using FPGA
A parallel and pipelined Fast Fourier Transform (FFT) processor for use in the Orthogonal Frequency division Multiplexer (OFDM) and WLAN, unlike being stored in the traditional ROM. The twiddle factors in our pipelined FFT processor can be accessed directly. A novel simple address mapping scheme and the modified radix 4 FFT also proposed. FPGA was majorly used to develop the ASIC IC’s to which ...
متن کاملLow - Power - Adaptive MC - CDMA Receiver Architecture
This paper proposes a novel concept of adjusting the hardware size in a multi-carrier code division multiple access (MC-CDMA) receiver in real time as per the channel parameters such as delay spread, signal-to-noise ratio, transmission rate, and Doppler frequency. The fast Fourier transform (FFT) or inverse FFT (IFFT) size in orthogonal frequency division multiplexing (OFDM)/MC-CDMA transceiver...
متن کاملFPGA Based Implementation of FFT Processor Using Different Architectures
The Fast Fourier Transform (FFT) is an efficient algorithm for computing the Discrete Fourier Transform (DFT) and requires less number of computations than that of direct evaluation of DFT. It has several applications in signal processing. Because of the complexity of the processing algorithm of FFT, recently various FFT algorithms have been proposed to meet real-time processing requirements an...
متن کاملDesign and Implementation of a 1024-point Pipeline FFT Processor
Design and implementation of a 1024-point pipeline FFT processor is presented. The architecture is based on a new form of FFT, the r a d i ~ 2 ~ algorithm. By exploiting the spatial regularity of the new algorithm, minimal requirement for both dominant components in PLSI implementation has been achieved: only 4 complex multipliers and 1024 complex-word data memory for the pipelined 1K FFT proce...
متن کامل